Evaluation of mesh simplification algorithms using PolyMeCo: a case study
نویسندگان
چکیده
Polygonal meshes are used in many application scenarios. Often the generated meshes are too complex not allowing proper interaction, visualization or transmission through a network. To tackle this problem, simplification methods can be used to generate less complex versions of those meshes. For this purpose many methods have been proposed in the literature and it is of paramount importance that each new method be compared with its predecessors, thus allowing quality assessment of the solution it provides. This systematic evaluation of each new method requires tools which provide all the necessary features (ranging from quality measures to visualization methods) to help users gain greater insight into the data. This article presents the comparison of two simplification algorithms, NSA and QSlim, using PolyMeCo, a tool which enhances the way users perform mesh analysis and comparison, by providing an environment where several visualization options are available and can be used in a coordinated way.
منابع مشابه
Kinetic Mechanism Reduction Using Genetic Algorithms, Case Study on H2/O2 Reaction
For large and complex reacting systems, computational efficiency becomes a critical issue in process simulation, optimization and model-based control. Mechanism simplification is often a necessity to improve computational speed. We present a novel approach to simplification of reaction networks that formulates the model reduction problem as an optimization problem and solves it using geneti...
متن کاملErratum to "PolyMeCo - An integrated environment for polygonal mesh analysis and comparison" [Computers & Graphics 33 (2009) 181-191]
Erratum to ‘‘POLYMECO—An integrated environment for polygonal mesh analysis and comparison’’ [Comput. Graphics 33 (2009) 181–191] Samuel Silva a,b, , Joaquim Madeira , Beatriz Sousa Santos a,b a Institute of Electronics and Telematics Engineering of Aveiro, University of Aveiro, 3810-193 Aveiro, Portugal b Department of Electronics, Telecommunications and Informatics, University of Aveiro, 3810...
متن کاملPAT: A pattern classification approach to automatic reference oracles for the testing of mesh simplification programs
Graphics applications often need to manipulate numerous graphical objects stored as polygonal models. Mesh simplification is an approach to vary the levels of visual details as appropriate, thereby improving on the overall performance of the applications. Different mesh simplification algorithms may cater for different needs, producing diversified types of simplified polygonal model as a result...
متن کاملCPU-GPU Algorithms for Triangular Surface Mesh Simplification
Mesh simplification and mesh compression are important processes in computer graphics and scientific computing, as such contexts allow for a mesh which takes up less memory than the original mesh. Current simplification and compression algorithms do not take advantage of both the central processing unit (CPU) and the graphics processing unit (GPU). We propose three simplification algorithms, on...
متن کاملEvaluation erosivity factor of rain using Geostatistical algorithms (case study: Ilam province, Iran)
Today, soil erosion is considered as one of main subjects of watershed management at national and global levels. Assessment of decreasing risk of soil and it spatial distribution are one of key factors for successful evaluation of soil erosion. The objectives of research were calculation and modeling of rain erosivity factor in Ilam province using data of number of 28 pluviometry stations durin...
متن کامل